Usage of LDPC Codes in a Gilbert Channel

نویسندگان

چکیده

Although low-density parity-check (LDPC) codes in modern communication standards have been extensively studied over a memoryless channel, their burst error correction capacity channels with memory has yet to be thoroughly analyzed. The conventional approach transmission uses interleaving within buffer of several codewords. However, such an reduces the efficiency redundancy embedded by error-correcting code. It is known from information theory that considering channel during decoding allows rate increased. An evaluation probability different types presented along estimates minimum distance and capability for considered codes. estimated deinterleaving taking into account. parameters lengths. obtained results reveal absence unique all memory. best determined degree correlation.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Density Evolution Analysis of Robustness for LDPC Codes over the Gilbert-Elliott Channel

In this paper, we analyze the robustness for low-density parity-check (LDPC) codes over the Gilbert-Elliott (GE) channel. For this purpose we propose a density evolution method for the case where LDPC decoder uses the mismatched parameters for the GE channel. Using this method, we derive the region of tuples of true parameters and mismatched decoding parameters for the GE channel, where the dec...

متن کامل

On the Usage of LDPC Codes in the McEliece Cryptosystem

In this paper, a new variant of the McEliece cryptosystem, based on Low-Density Parity-Check (LDPC) codes, is studied. Random-based techniques allow to design large families of LDPC codes with equivalent error correction capability; therefore, in principle, such codes can substitute Goppa codes, originally used by McEliece in his cryptosystem. Furthermore, Quasi-Cyclic (QC) LDPC codes can be ad...

متن کامل

LDPC Codes For The Classic Bursty Channel

In this paper we consider low-density parity-check (LDPC) codes for the classic bursty channel. We present lower bounds on the maximum resolvable erasure burst length, Lmax, for arbitrary LDPC codes and then present constructions for LDPC codes with good burst erasure correction performance for channels with and without the presence of noise in the guard band.

متن کامل

RS + LDPC-Staircase codes for the erasure channel: Standards, usage and performance

Application-Level Forward Erasure Correction (AL-FEC) codes are a key element of telecommunication systems. They are used to recover from packet losses when retransmission are not feasible and to optimize the large scale distribution of contents. In this paper we introduce Reed-Solomon/LDPCStaircase codes, two complementary AL-FEC codes that have recently been recognized as superior to Raptor c...

متن کامل

The error-floor of LDPC codes in the Laplacian channel

We analyze the performance of Low-Density-Parity-Check codes in the error-floor domain where the Signal-to-Noise-Ratio, s, is large, s 1. We describe how the instanton method of theoretical physics, recently adapted to coding theory, solves the problem of characterizing the error-floor domain in the Laplacian channel. An example of the (155;64;20) LDPC code with four iterations (each iteration ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Trudy u?ebnyh zavedenij svâzi

سال: 2023

ISSN: ['1813-324X', '2712-8830']

DOI: https://doi.org/10.31854/1813-324x-2022-8-4-55-63